ANALYZING MICROARRAY DATA WITH TRANSITIVE DIRECTED ACYCLIC GRAPHS

Analyzing Directed Acyclic Graph Recombination

This work studies the edge-based representation of directed acyclic graphs, as well as the properties of recombination operators working on it. It is shown that this representation is not separable, and the structure of the basic information units that must be processed in order to maintain feasibility of the solutions is described. As an experimental analysis indicates, a recombination operato...

Generic Directed Acyclic Graphs

Copula directed acyclic graphs

We present a new methodology for selecting a Bayesian network for continuous data outside the widely used class of multivariate normal distributions. The use of bivariate copula densities to model connections between pairs of nodes in the network brings in flexibility in the choice of the distribution. Cand D-vines play a central role in dealing with the high-dimensional aspect of the data, due...

Directed acyclic graphs with edge-specific bounds.

We give a definition of a bounded edge within the causal directed acyclic graph framework. A bounded edge generalizes the notion of a signed edge and is defined in terms of bounds on a ratio of survivor probabilities. We derive rules concerning the propagation of bounds. Bounds on causal effects in the presence of unmeasured confounding are also derived using bounds related to specific edges on...

Use of Directed Acyclic Graphs

This supplement describes how counterfactual theory is used to define causal effects and the conditions in which observed data can be used to estimate counterfactual-based causal effects. Basic definitions and language used in causal graph theory are then presented. The graphical separation rules linking the causal assumptions encoded in a diagram to the statistical relations implied by the cau...